Some special minimum k-geodetically connected graphs
نویسندگان
چکیده
A connected graph G is k-geodetically connected (k-GC) if the removal of less than k vertices does not affect the distances (lengths of the shortest paths) between any pair of the remaining vertices. As such graphs have important applications in robust system designs, we are interested in theminimumnumber of edges required tomake a k-GC graph of order n, and characterizing those minimum k-GC graphs. When 3 < k < (n − 1)/2, minimum k-GC graphs are not yet known in general, even the minimum number of edges m(n, k) is not determined. In this paper, we will determine all of the minimum k-GC graphs for an infinite set of special (n, k) pairs that were formerly unknown. To derive our results, we also developed new bounds onm(n, k). Additionally, we show that k-GC graphs with small relative optimality gaps can be easily constructed and expanded with great flexibilities, which gives convenient applications for robust system designs. © 2011 Elsevier B.V. All rights reserved.
منابع مشابه
The Recognition of Geodetically Connected Graphs 1
Let G = (V;E) be a graph with vertex set V of size n and edge set E of size m. A vertex v 2 V is called a hinge vertex if the distance of any two vertices becomes longer after v is removed. A graph without hinge vertex is called a hingefree graph. In general, a graph G is k-geodetically connected or k-GC for short if G can tolerate any k 1 vertices failures without increasing the distance among...
متن کاملThe Recognition of Geodetically Connected Graphs
Let G = (V; E) be a graph with vertex set V of size n and edge set E of size m. A vertex v 2 V is called a hinge vertex if the distance of any two vertices becomes longer after v is removed. A graph without hinge vertex is called a hinge-free graph. In general, a graph G is k-geodetically connected or k-GC for short if G can tolerate any k ?1 vertices failures without increasing the distance am...
متن کاملON THE NUMBER OF CYCLES IN k–CONNECTED GRAPHS
We give estimations for the minimum number of cycles in three special subclasses of the class of k-connected graphs.
متن کاملOn Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملNordhaus-Gaddum type results for the Harary index of graphs
The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 159 شماره
صفحات -
تاریخ انتشار 2011